Papers with vanilla Transformers

4 papers
Transformer-XL: Attentive Language Models beyond a Fixed-Length Context (P19-1)

Copied to clipboard

Challenge: Term memory networks (RNNs) are difficult to optimize due to gradient vanishing and explosion.
Approach: They propose a neural architecture Transformer-XL that enables learning dependency beyond a fixed length without disrupting temporal coherence.
Outcome: The proposed method improves state-of-the-art performance on short and long sequences and generates coherent, novel text articles with thousands of tokens.
Efficient Transformers with Dynamic Token Pooling (2023.acl-long)

Copied to clipboard

Challenge: Hourglass Transformers is a computationally efficient model that can be used to reduce the sequence length in the intermediate layers.
Approach: They propose a dynamic-pooling mechanism which predicts segment boundaries in an autoregressive fashion.
Outcome: The proposed model is faster and more accurate than vanilla Transformers and fixed-length pooling within the same computational budget.
IIET: Efficient Numerical Transformer via Implicit Iterative Euler Method (2025.emnlp-main)

Copied to clipboard

Challenge: High-order numerical methods enhance performance in tasks like NLP but introduce a performance-efficiency trade-off due to increased computational overhead.
Approach: They propose an iterative implicit Euler Transformer which simplifies high-order numerical methods by iterating implicit Eule.
Outcome: The proposed method improves accuracy and reduces inference overhead by 55% while retaining 99.4% of the original task accuracy.
If Attention Serves as a Cognitive Model of Human Memory Retrieval, What is the Plausible Memory Representation? (2025.acl-long)

Copied to clipboard

Challenge: Recent work in computational psycholinguistics has revealed intriguing parallels between attention mechanisms and human memory retrieval, focusing primarily on vanilla Transformers that operate on token-level representations.
Approach: They propose that the attention mechanism of Transformer Grammar (TG) can serve as a cognitive model of human memory retrieval using Normalized Attention Entropy (NAE) they propose that TG's attention can implement a human memory-retrieval theory known as cue-based retrieval .
Outcome: The attention mechanism of Transformer Grammar (TG) achieves superior predictive power for self-paced reading times compared to vanilla Transformer’s, with further analyses revealing independent contributions from both models.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations